Implementing -reduction by Hypergraph Rewriting
نویسنده
چکیده
The aim of this paper is to implement the-reduction in the-calculus with a hypergraph rewriting mechanism called collapsed-tree rewriting. It turns out that collapsed-tree rewriting is sound with respect to-reduction and complete with respect to the Gross-Knuth strategy. As a consequence, there exists a normal form for a collapsed-tree if and only if there exists a normal form for the represented-term.
منابع مشابه
Towards a Substrate Framework of Computation
A grand challenge in computing is to establish a substrate computational model that encompasses diverse forms of non-sequential computation. This paper demonstrates how a hypergraph rewriting framework nicely integrates various forms and ingredients of concurrent computation and how simple static analyses help the understanding and optimization of programs. Hypergraph rewriting treats processes...
متن کاملImplementing term rewriting by jungle evaluation
Jungles are acyclic hypergraphs which represent sets of terms such that common subterms can be shared. Term rewrite rules are translated into jungle evaluation rules which implement parallel term rewriting steps. By using additional hypergraph rules which “fold” equal subterms, even non-left-linear term rewriting systems can be implemented. As a side effect, these folding rules can speed up the...
متن کاملA Graph Rewriting Semantics for the Polyadic Calculus
We give a hypergraph rewriting semantics for the polyadic π-calculus, based on rewriting rules equivalent to those in the double-pushout approach. The structural congruence of the π-calculus is replaced by hypergraph isomorphism. The correctness of the encoding from the graph-based notation into π-calculus can be shown by using an intermediate notation, so-called name-based graph terms.
متن کاملHypergraph rewriting using conformisms
In this paper we study single-pushout transformation in a category of spans, a generalization of the notion of partial morphism in, for instance, 2,4]. As an application, single-pushout transformation in a category of hypergraphs with a special type of partial morphisms, the conformisms, is presented. In particular , we show the existence of the pushout of any pair of conformisms of hypergraphs...
متن کاملRewriting in Free Hypegraph Categories
We study rewriting for equational theories in the context of symmetric monoidal categories where there is a separable Frobenius monoid on each object. These categories, also called hypergraph categories, are increasingly relevant: Frobenius structures recently appeared in cross-disciplinary applications, including the study of quantum processes, dynamical systems and natural language processing...
متن کامل